BSRone: Binary Search with Routing of O(1); A Scalable Circular Design for Distributed Networks

نویسندگان

  • Alireza Naghizadeh
  • Tahereh Yourdkhani
  • Behrooz Razeghi
  • Ehsan Meamari
چکیده

Peer-to-Peer (P2P) networks as distributed solutions are used in a variety of applications. Based on the type of routing for queries among their nodes, they are classified into three groups: structured, unstructured and small-world P2P networks. Each of these categories has its own applications and benefits. Structured networks by using Distributed Hash Tables (DHT) can forward request search queries more efficiently. These networks usually organize a specific topology and make a geometrical shape. A circular topology is a prevalent design which was first introduced by Chord. In this paper, we propose BSROne, a circular structured P2P design which attempts to consider several shortcomings in the current networks. In our proposed method, we want to achieve O(1) routing time without requiring all of the nodes to know about each other. By removing the real connections between nodes and tying all of them with super-nodes, we could reduce the number of overheads that are essential to maintain the connectivity between nodes in such networks. Furthermore, we gave the network an ability to scale up by introducing one layer above super-nodes. We achieved this by emulating the design of binary search algorithm for supreme-nodes. In this paper, at first we introduce a design where fixed super-nodes with unlimited resources are given A. Naghizadeh Department of Computer Engineering, Guilan University, Iran E-mail: [email protected] T. Yourdkhani Department of Computer Engineering, Semnan University, Iran E-mail: [email protected] B. Razeghi Department of Electrical Engineering, Ferdowsi University of Mashhad, Iran E-mail: [email protected] E. Meamari Department of Electrical Engineering, Iran University of Science and Technology, Iran E-mail: [email protected] 2 A. Naghizadeh, T. Yourdkhani, B. Razeghi, E. Meamari to the distributed network. In the next step, we explain how it can manage to work as a P2P application. We finally discuss the possibility of removing the scalability issue in a P2P environment for our design.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and evaluation of two scalable protocols for location management of mobile nodes in location based routing protocols in mobile Ad Hoc Networks

Heretofore several position-based routing protocols have been developed for mobile ad hoc networks. Many of these protocols assume that a location service is available which provides location information on the nodes in the network.Our solutions decrease location update without loss of query success rate or throughput and even increase those.Simulation results show that our methods are effectiv...

متن کامل

Design and evaluation of two scalable protocols for location management of mobile nodes in location based routing protocols in mobile Ad Hoc Networks

Heretofore several position-based routing protocols have been developed for mobile ad hoc networks. Many of these protocols assume that a location service is available which provides location information on the nodes in the network.Our solutions decrease location update without loss of query success rate or throughput and even increase those.Simulation results show that our methods are effectiv...

متن کامل

Binary Location-Search Based Scalable Routing Protocol For Ad Hoc Networks

In this article, we present a binary location search based scalable routing protocol (BinLS) for ad hoc networks. It is completely distributed and based on a location management strategy that keeps the overhead of routing packets significantly small. The network is divided into some equal sized rectangular grid cells. Each node is assigned a home grid cell from where it starts its activity (tra...

متن کامل

A New Method based on Intelligent Water Drops for Multicast Routing in Wireless Mesh Networks

In recent years a new type of wireless networks named wireless mesh networks has drawn the attention of researchers. In order to increase the capacity of mesh network, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi channel wireless mesh networks. Therefore, the main challenge of these networks is how to properly assign the channels to the radios. O...

متن کامل

A Priority-based Routing Algorithm for Underwater Wireless Sensor Networks (UWSNs)

Advances in low-power electronics design and wireless communication have enabled the development of low cost, low power micro-sensor nodes. These sensor nodes are capable of sensing, processing and forwarding which have many applications such as underwater networks. In underwater wireless sensor networks (UWSNs) applications, sensors which are placed in underwater environments and predicted ena...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1408.2813  شماره 

صفحات  -

تاریخ انتشار 2014